An Extension of Earley's Algorithm for S-Attributed Grammars
نویسنده
چکیده
Attribute grammars are an elegant formalization of the augmented context-free grammars characteristic of most current natural language systems. This paper presents an extension of Earley's algorithm to Knuth's attribute grammars, considering the case of S-attributed grammars. For this case, we study the conditions on the underlying base grammar under which the extended algorithm may be guaranteed to terminate. Finite partitioning of attribute domains is proposed to guarantee the termination of the algorithm, without the need for any restrictions on the context-free base.
منابع مشابه
Nonminimal Derivations in Unification-Based Parsing
Shieber's abstract parsing algorithm (Shieber 1992)for unification grammars is an extension of Earley's algorithm (Earley 1970)for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber ' s algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While ...
متن کاملAn Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
We describe an extension of Earley's parser for stochastic context-free grammars that computes the following quantities given a stochastic context-free grammar and an input string: a) probabilities of successive prefixes being generated by the grammar; b) probabilities of substrings being generated by the nonterminals, including the entire string being generated by the grammar; c) most likely (...
متن کاملFormalization and Parsing of Typed Unification-Based ID/LP Grammars
This paper de nes uni cation based ID/LP grammars based on typed feature structures as nonterminals and proposes a variant of Earley's algorithm to decide whether a given input sentence is a member of the language generated by a particular typed uni cation ID/LP grammar. A solution to the problem of the nonlocal ow of information in uni cation ID/LP grammars as mentioned in Sei ert (1991) is in...
متن کاملPolynomial Time and Space Shift-Reduce Parsing of Arbitrary Context-free Grammars
We introduce an algorithm for designing a predictive left to right shift-reduce non-deterministic push-down machine corresponding to an arbitrary unrestricted context-free grammar and an algorithm for efficiently driving this machine in pseudo-parallel. The performance of the resulting parser is formally proven to be superior to Earley's parser (1970). The technique employed consists in constru...
متن کاملReference Attributed Grammars
An extension to canonical attribute grammars is introduced, permitting attributes to be references to arbitrary nodes in the syntax tree, and attributes to be accessed via the reference attributes. Important practical problems such as name and type analysis for object-oriented languages can be expressed concisely in these grammars, and an optimal evaluation algorithm is available. The proposed ...
متن کامل